An affine walk on the hypercube

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An affine walk on the hypercube

Diaconis, P. and R. Graham, An affine walk on the hypercube, Journal of Computational and Applied Mathematics 41 (1992) 215-235. Let Z$ be the group of binary d-tuples. We study the process X,, = AX,,_ 1 + l n with Xi E Z;, A fiied in GL,(H,) and E, a random vector of disturbance terms. This models algorithms in the presence of a “bad bit”. For a class of situations we show that the distributio...

متن کامل

7.1 Random Walk on Truncated Hypercube

In the last lecture we analyzed a random walk on a truncated cube, where Ω = {x ∈ {0, 1}|∑ni=1 aixi ≤ b}. The mixing time of this random walk can be shown to be O(n), where n is the dimension of the cube [MS99]. We presented a slightly simplified analysis that gave a mixing time bound of n 2), under the assumption that 1 ≤ max |ai| ≤ B (i.e., the ratio of the weights is bounded). We used a flow...

متن کامل

Cutoff for a Stratified Random Walk on the Hypercube

We consider the random walk on the hypercube which moves by picking an ordered pair (i, j) of distinct coordinates uniformly at random and adding the bit at location i to the bit at location j, modulo 2. We show that this Markov chain has cutoff at time 2n logn with window of size n, solving a question posed by Chung and Graham (1997). 1998 ACM Subject Classification G.3 Probability

متن کامل

Optimal co-adapted coupling for the symmetric random walk on the hypercube

Let X and Y be two simple symmetric continuous-time random walks on the vertices of the n-dimensional hypercube, Zn2 . We consider the class of coadapted couplings of these processes, and describe an intuitive coupling which is shown to be the fastest in this class.

متن کامل

Random Walk in an Alcove of an Affine Weyl Group, and Non-colliding Random Walks on an Interval

Abstract. We use a reflection argument, introduced by Gessel and Zeilberger, to count the number of k-step walks between two points which stay within a chamber of a Weyl group. We apply this technique to walks in the alcoves of the classical affine Weyl groups. In all cases, we get determinant formulas for the number of k-step walks. One important example is the region m > x1 > x2 > · · · > xn ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational and Applied Mathematics

سال: 1992

ISSN: 0377-0427

DOI: 10.1016/0377-0427(92)90251-r